Transient exponential-Erlang queues and steady-state simulation
نویسندگان
چکیده
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملSimulation Steady - State Simulation
We will discuss several techniques for obtaining point estimates and confidence intervals for steady-state performance measures. Let (X(t): t≥ 0) be a GSMP with (discrete) state space S that represents the underlying stochastic process of a simulation. Fix a real-valued function f defined on S and set Y(t) = f(X(t)) for t ≥ 0. There are several possible ways to define steady-state performance m...
متن کاملSome effects of transient deletion on sequential steady-state simulation
In discrete event steady-state simulation, deleting the initial transient phase of the simulation is usually recommended in order to reduce bias in the results. Various heuristics and tests have been proposed to determine how many observations to delete. The plummeting cost of simulation, combined with uncertainties about the overall reliability of transient methods, suggests revisiting the not...
متن کاملNonstationary Erlang Loss Queues and Networks
ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...
متن کاملClassroom Note: Calculation of Steady-State Probabilities of M/M Queues: Further Approaches (Running title: Calculation of Steady-State Queues)
This paper draws attention to the risk of rounding error in the numerical evaluation of steady-state probabilities for the M/M family of queues. A method for avoiding the risk is presented which is easy to program for calculation in practice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1985
ISSN: 0001-0782,1557-7317
DOI: 10.1145/3894.3900